// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int n,ans=0;
vector<int> v[10001],t,w;
int dfs(int x)
{
	if(w[x])return w[x];
	for(int i=0;i<v[x].size();i++)
	{
		w[x]=max(w[x],dfs(v[x][i]));
	}
	w[x]+=t[x];
	return w[x];
}
signed main()
{

	cin>>n;
	w=t=vector<int>(n+1);
	for(int i=1;i<=n;i++)
	{
		int x,y;
		cin>>x>>t[x];
		while(cin>>y)
		{
			if(!y)break;
			else v[y].push_back(x);
		}
	}
	for(int i=1;i<=n;i++)
	{
		ans=max(ans,dfs(i));
	}
	cout<<ans;
	return 0;
}
